Towards Removing the Concurrency Control Bottleneck
نویسندگان
چکیده
In this paper we describe an implementation of a software transactional memory system that is capable of exploiting an increase in parallelism to improve performance. We demonstrate the improvements in performance via benchmarking our system against a standard STM. For the first time we show that parallelism can be exploited to offset an increase in contention. This provides a system where the concurrency control bottleneck is effectively removed given sufficient parallel resources. © 2012 Newcastle University. Printed and published by Newcastle University, Computing Science, Claremont Tower, Claremont Road, Newcastle upon Tyne, NE1 7RU, England. Bibliographical details SHARP, C., MORGAN, G. Towards Removing the Concurrency Control Bottleneck [By] C. Sharp, G. Morgan Newcastle upon Tyne: Newcastle University: Computing Science, 2012. (Newcastle University, Computing Science, Technical Report Series, No. CS-TR-1358)
منابع مشابه
A Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملDistributed Database Systems in High-Speed Wide-Area Networks
In a distributed database system (DDBS), the data is partitioned into smaller databases and distributed over multiple sites in a computer network. Associated with a DDBS are functions like query processing and concurrency control. Traditionally in DDBS research, the computer network has been considered a performance bottleneck and a lot of research eeort has been directed towards the design of ...
متن کاملA Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملExploring the Limits of Disjoint Access Parallelism
The desire to extract parallelism has recently focused attention on improving concurrency control mechanisms in applications. However, programmers have few tools to help them understand the synchronisation bottlenecks that exist in their programs – for example to identify which locks are heavily contended, and whether different operations protected by the same lock are likely to conflict in pra...
متن کاملImproving the parallelism and concurrency in decoupled architectures
Concurrency between access and execution has been exploited by queues in many decoupled access-execute architectures, but data dependent control dependencies often prohibit prefetch-ing of data to queues. This paper investigates a technique to facilitate anticipatory loading to queues even in presence of data dependent control dependencies. The proposed method consists of fetching along one or ...
متن کامل